package 二叉树层序遍历.二叉树层序遍历I;

import java.util.List;

public class Test {
    public static void main(String[] args) {
        Solution solution = new Solution();
        TreeNode root = new TreeNode(3);
        root.left = new TreeNode(9);
        root.right = new TreeNode(20);
        root.right.left = new TreeNode(15);
        root.right.right = new TreeNode(7);

        TreeNode rootTwo = null;

        List<List<Integer>> result = solution.levelOrder(rootTwo);
        System.out.println(result);
    }
}
